/*
 TASK: Distinct Primes
 ALGO: brute-force
Sample Input:
3
1
2
 1000
Sample Output:
30
42
 2664
*/

#include <vector>
#include <iostream>

using namespace std;

int main()
{
    int prime1000[] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997};
    int primeNum=sizeof(prime1000)/sizeof(int);
    vector<int> num(3000,0);
    //printf("sizeof(prime1000) = %d\n",primeNum);
    for(int i=0;i<primeNum;i++)
    {
        for(int j=prime1000[i]*2;j<3000;j+=prime1000[i])
        {
            num[j]++;
            //printf("num[%d] = %d\n", j, num[j]);
        }
    }
    //printf("haha\n");
    vector<int> pre;
    for(int i=0;i<num.size();i++)
    {
        //printf("%d - %d ", i, num[i]);
        if(num[i]>=3)
            pre.push_back(i);
    }
    /*for(int i=0;i<pre.size();i++)
    {
        printf("%d - %d ", i+1, pre[i]);
        if(i%10==0)
            printf("\n");
    }*/    
    int t,n;
    cin>>t;
    while (t--) {
        cin>>n;
        cout<<pre[n-1]<<endl;
    }
    return 0;
}